Checking for Isomorphism in Circulant Graphs
نویسندگان
چکیده
We construct a deterministic algorithm that tests whether two circulant graphs are isomorphic. The running time is O(n2(logn)6), where n is the number of vertices of each graph. Our algorithm works for directed, undirected, and edge-colored circulants.
منابع مشابه
The isomorphism problem for circulant graphs via Schur ring theory
This paper concerns the applications of Schur ring theory to the isomorphism problem of circulant graphs (Cayley graphs over cyclic groups). A digest of the most important facts about Schur rings presented in the first sections provides the reader with agentie self-eontained introduction to this area. The developed machinery allows us to give proofs of two eonjectures (Zibin' 1975 and Toida 197...
متن کاملAutomorphism Groups and Spectra of Circulant Graphs
We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize than other graphs. We introduce connection sets as a way to describe isomorphism among some circulant graphs and discuss Ádám’s conjecture that attempts to generalize this idea to all circulant graphs, exploring cases in which the conjecture holds and cases in which it f...
متن کاملCyclic Graphs
A subclass of the class of circulant graphs is considered. It is shown that in this subclass, isomorphism is equivalent to Adam-isomorphism. Various results are obtained for the chromatic number, line-transitivity and the diameter.
متن کاملHardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case. In contrast, we show that, under additional constraints, e.g., prime order and/or sparseness, GRAPH ISOMORPHISM and MINIMUM GRAPH COLORING become easier in the circulant case, and we take advantage of spectral techniques for their efficien...
متن کاملA Solution of the Isomorphism Problem for Circulant Graphs
All graphs considered in the paper are directed. Let % be a graph on n vertices which we identify with the elements of the additive cyclic group Zn 1⁄4 f0; 1; . . . ; n 1g. The graph % is called circulant if it has a cyclic symmetry, that is, if the permutation ð0; 1; 2; . . . ; n 1Þ is an automorphism of the graph. Each circulant graph is completely determined by its connection set S which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010